\hypertarget{neighbor__joining_8cpp}{
\section{/home/ask/lcr/svn/Projetos/PhGA\_\-Project/neighbor\_\-joining/neighbor\_\-joining.cpp File Reference}
\label{neighbor__joining_8cpp}\index{/home/ask/lcr/svn/Projetos/PhGA\_\-Project/neighbor\_\-joining/neighbor\_\-joining.cpp@{/home/ask/lcr/svn/Projetos/PhGA\_\-Project/neighbor\_\-joining/neighbor\_\-joining.cpp}}
}
{\tt \#include \char`\"{}neighbor\_\-joining.h\char`\"{}}\par


Include dependency graph for neighbor\_\-joining.cpp:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=194pt]{neighbor__joining_8cpp__incl}
\end{center}
\end{figure}
\subsection*{Functions}
\begin{CompactItemize}
\item 
\hyperlink{class_graph___node}{Graph\_\-Node} $\ast$ \hyperlink{neighbor__joining_8cpp_f534fee85eebe5a80542f39490c093e7}{neighborJoining} (float $\ast$$\ast$distance\_\-matrix, int n, int $\ast$node\_\-to\_\-cut)
\item 
\hyperlink{class_graph___node}{Graph\_\-Node} $\ast$ \hyperlink{neighbor__joining_8cpp_e7e8733b7538e715110915c522580bea}{neighborJoining} (float $\ast$$\ast$distance\_\-matrix, int n)
\item 
float \hyperlink{neighbor__joining_8cpp_47ed58c6b56b38a49b39a0a8979c2b9d}{oldDistance} (int a, int b, float $\ast$$\ast$matrix)
\item 
void \hyperlink{neighbor__joining_8cpp_be75d5b7f124bb5ee1f5466c058785ce}{returnMaximumMinimumWeights} (float $\ast$maximum, float $\ast$minimum, \hyperlink{class_graph___node}{Graph\_\-Node} $\ast$root)
\item 
void \hyperlink{neighbor__joining_8cpp_bef47dd6a227afb070b25a1451b0e87c}{recursiveMaximumMinimumWeights} (float $\ast$maximum, float $\ast$minimum, \hyperlink{class_graph___node}{Graph\_\-Node} $\ast$root)
\item 
void \hyperlink{neighbor__joining_8cpp_0aee9da7a34c2242a4f7df6484407a92}{returnMaximumMinimumLeafWeights} (float $\ast$maximum, float $\ast$minimum, \hyperlink{class_graph___node}{Graph\_\-Node} $\ast$root)
\item 
void \hyperlink{neighbor__joining_8cpp_234ec74b924923b8fafc1a920a47b56e}{recursiveMaximumMinimumLeafWeights} (float $\ast$maximum, float $\ast$minimum, \hyperlink{class_graph___node}{Graph\_\-Node} $\ast$root, bool $\ast$is\_\-first\_\-weight)
\item 
void \hyperlink{neighbor__joining_8cpp_15b0091c70364fecf8a29c67c1191a7d}{normalizeLeafNodes} (float minimum, \hyperlink{class_graph___node}{Graph\_\-Node} $\ast$tree, float $\ast$tree\_\-maximum, float $\ast$tree\_\-minimum)
\item 
void \hyperlink{neighbor__joining_8cpp_34269ceb61a534650a51b3e695918d57}{recursiveNormalizeLeafNodes} (float minimum, \hyperlink{class_graph___node}{Graph\_\-Node} $\ast$tree, float $\ast$tree\_\-maximum, float $\ast$tree\_\-minimum)
\end{CompactItemize}


\subsection{Function Documentation}
\hypertarget{neighbor__joining_8cpp_e7e8733b7538e715110915c522580bea}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!neighborJoining@{neighborJoining}}
\index{neighborJoining@{neighborJoining}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{neighborJoining}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Graph\_\-Node}$\ast$ neighborJoining (float $\ast$$\ast$ {\em distance\_\-matrix}, \/  int {\em n})}}
\label{neighbor__joining_8cpp_e7e8733b7538e715110915c522580bea}


\hypertarget{neighbor__joining_8cpp_f534fee85eebe5a80542f39490c093e7}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!neighborJoining@{neighborJoining}}
\index{neighborJoining@{neighborJoining}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{neighborJoining}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Graph\_\-Node}$\ast$ neighborJoining (float $\ast$$\ast$ {\em distance\_\-matrix}, \/  int {\em n}, \/  int $\ast$ {\em node\_\-to\_\-cut})}}
\label{neighbor__joining_8cpp_f534fee85eebe5a80542f39490c093e7}


\hypertarget{neighbor__joining_8cpp_15b0091c70364fecf8a29c67c1191a7d}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!normalizeLeafNodes@{normalizeLeafNodes}}
\index{normalizeLeafNodes@{normalizeLeafNodes}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{normalizeLeafNodes}]{\setlength{\rightskip}{0pt plus 5cm}void normalizeLeafNodes (float {\em minimum}, \/  {\bf Graph\_\-Node} $\ast$ {\em tree}, \/  float $\ast$ {\em tree\_\-maximum}, \/  float $\ast$ {\em tree\_\-minimum})}}
\label{neighbor__joining_8cpp_15b0091c70364fecf8a29c67c1191a7d}


\hypertarget{neighbor__joining_8cpp_47ed58c6b56b38a49b39a0a8979c2b9d}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!oldDistance@{oldDistance}}
\index{oldDistance@{oldDistance}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{oldDistance}]{\setlength{\rightskip}{0pt plus 5cm}float oldDistance (int {\em a}, \/  int {\em b}, \/  float $\ast$$\ast$ {\em matrix})}}
\label{neighbor__joining_8cpp_47ed58c6b56b38a49b39a0a8979c2b9d}


\hypertarget{neighbor__joining_8cpp_234ec74b924923b8fafc1a920a47b56e}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!recursiveMaximumMinimumLeafWeights@{recursiveMaximumMinimumLeafWeights}}
\index{recursiveMaximumMinimumLeafWeights@{recursiveMaximumMinimumLeafWeights}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{recursiveMaximumMinimumLeafWeights}]{\setlength{\rightskip}{0pt plus 5cm}void recursiveMaximumMinimumLeafWeights (float $\ast$ {\em maximum}, \/  float $\ast$ {\em minimum}, \/  {\bf Graph\_\-Node} $\ast$ {\em root}, \/  bool $\ast$ {\em is\_\-first\_\-weight})}}
\label{neighbor__joining_8cpp_234ec74b924923b8fafc1a920a47b56e}


\hypertarget{neighbor__joining_8cpp_bef47dd6a227afb070b25a1451b0e87c}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!recursiveMaximumMinimumWeights@{recursiveMaximumMinimumWeights}}
\index{recursiveMaximumMinimumWeights@{recursiveMaximumMinimumWeights}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{recursiveMaximumMinimumWeights}]{\setlength{\rightskip}{0pt plus 5cm}void recursiveMaximumMinimumWeights (float $\ast$ {\em maximum}, \/  float $\ast$ {\em minimum}, \/  {\bf Graph\_\-Node} $\ast$ {\em root})}}
\label{neighbor__joining_8cpp_bef47dd6a227afb070b25a1451b0e87c}


\hypertarget{neighbor__joining_8cpp_34269ceb61a534650a51b3e695918d57}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!recursiveNormalizeLeafNodes@{recursiveNormalizeLeafNodes}}
\index{recursiveNormalizeLeafNodes@{recursiveNormalizeLeafNodes}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{recursiveNormalizeLeafNodes}]{\setlength{\rightskip}{0pt plus 5cm}void recursiveNormalizeLeafNodes (float {\em minimum}, \/  {\bf Graph\_\-Node} $\ast$ {\em tree}, \/  float $\ast$ {\em tree\_\-maximum}, \/  float $\ast$ {\em tree\_\-minimum})}}
\label{neighbor__joining_8cpp_34269ceb61a534650a51b3e695918d57}


\hypertarget{neighbor__joining_8cpp_0aee9da7a34c2242a4f7df6484407a92}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!returnMaximumMinimumLeafWeights@{returnMaximumMinimumLeafWeights}}
\index{returnMaximumMinimumLeafWeights@{returnMaximumMinimumLeafWeights}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{returnMaximumMinimumLeafWeights}]{\setlength{\rightskip}{0pt plus 5cm}void returnMaximumMinimumLeafWeights (float $\ast$ {\em maximum}, \/  float $\ast$ {\em minimum}, \/  {\bf Graph\_\-Node} $\ast$ {\em root})}}
\label{neighbor__joining_8cpp_0aee9da7a34c2242a4f7df6484407a92}


\hypertarget{neighbor__joining_8cpp_be75d5b7f124bb5ee1f5466c058785ce}{
\index{neighbor\_\-joining.cpp@{neighbor\_\-joining.cpp}!returnMaximumMinimumWeights@{returnMaximumMinimumWeights}}
\index{returnMaximumMinimumWeights@{returnMaximumMinimumWeights}!neighbor_joining.cpp@{neighbor\_\-joining.cpp}}
\subsubsection[{returnMaximumMinimumWeights}]{\setlength{\rightskip}{0pt plus 5cm}void returnMaximumMinimumWeights (float $\ast$ {\em maximum}, \/  float $\ast$ {\em minimum}, \/  {\bf Graph\_\-Node} $\ast$ {\em root})}}
\label{neighbor__joining_8cpp_be75d5b7f124bb5ee1f5466c058785ce}


